Tom Thumb Algorithm and von Neumann Universal Constructor
نویسندگان
چکیده
This article describes the addition to the von Neumann cellular automaton of the Tom Thumb Algorithm, a mechanism developed for the self-replication of multi-processor systems. Except for the cell construction process, every functionality of the original CA has been preserved in our new system. Moreover, the Tom Thumb Algorithm now allows the replication of any structure within the von Neumann environment, whatever its number of cells may be.
منابع مشابه
Blueprint for Self-replicating and Self-assembling 3D Printers
In the 1940s Stanislaw Ulam and John Von Neumann came up with the idea of cellular Automata (CAs), which Von Neumann later used to develop a universal constructor (Neumann, 1966). The universal constructor is a pattern implemented in a CA that consists of a two parts: The universal constructor and a tape. The universal constructor reads from the tape and produces what is encoded. A universal co...
متن کاملAn Implementation of von Neumann's Self-Reproducing Machine
This article describes in detail an implementation of John von Neumann's self-reproducing machine. Self-reproduction is achieved as a special case of construction by a universal constructor. The theoretical proof of the existence of such machines was given by John von Neumann in the early 1950s [6], but was first implemented in 1994, by the author in collaboration with R. Nobili. Our implementa...
متن کاملQuantum mechanical Universal constructor
Arbitrary quantum states cannot be copied. In fact, to make a copy we must provide complete information about the system. However, can a quantum system self-replicate? This is not answered by the no-cloning theorem. In the classical context, Von Neumann showed that a ‘universal constructor’ can exist which can self-replicate an arbitrary system, provided that it had access to instructions for m...
متن کاملRecent studies on self - replicating structures implemented on cellular automata
Cellular automata (CA for short) proposed by J. von Neumann and S. Ulam in the middle of 1960's are dynamical systems where time, space and states of sites are all discrete. They consist of a d-dimensional array of identical automata (cells), each of which has one of the nite states and changes its state according to the state-transition rule sets mapping from states of its neighbor cells (usua...
متن کاملComputational Ontogeny
When the computer scientist seeks to model natural phenomena, he or she may select from two paths. Modeling may be by representation or by realization. This distinction is clarified by means of a simple physical example: an adiabatic pressure vessel. A representational model will in no way involve the operation of such a vessel even as a real gas law is observed (like van der Waals’ gas law), w...
متن کامل